Quantum algorithms

Results: 145



#Item
51The Complexity of Renaming Dan Alistarh EPFL James Aspnes Yale

The Complexity of Renaming Dan Alistarh EPFL James Aspnes Yale

Add to Reading List

Source URL: www.comp.nus.edu.sg

Language: English - Date: 2011-11-17 23:45:06
52International Journal of Theoretical Physics, VoL 21, Nos. 6/7, 1982  Simulating Physics with Computers Richard P. Feynman Department of Physics, California Institute of Technology, Pasadena, CaliforniaReceived Ma

International Journal of Theoretical Physics, VoL 21, Nos. 6/7, 1982 Simulating Physics with Computers Richard P. Feynman Department of Physics, California Institute of Technology, Pasadena, CaliforniaReceived Ma

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2007-09-05 22:45:11
53Uniform Generation of NP-witnesses using an NP-oracle Mihir Bellare Oded Goldreichy

Uniform Generation of NP-witnesses using an NP-oracle Mihir Bellare Oded Goldreichy

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2014-06-22 06:24:53
54Susan Margulies margulie at usna dot edu United States Naval Academy, Department of Mathematics, Annapolis, MDResearch Interests Optimization, Graph Theory, Computer Algebra, Algorithms and Complexity, Quantum Com

Susan Margulies margulie at usna dot edu United States Naval Academy, Department of Mathematics, Annapolis, MDResearch Interests Optimization, Graph Theory, Computer Algebra, Algorithms and Complexity, Quantum Com

Add to Reading List

Source URL: www.usna.edu

Language: English - Date: 2015-05-19 21:11:47
55Lower Bounds for Expected-Case Planar Point Location Theocharis Malamatos∗ point lies on a segment or vertex of S is zero.) The entropy P of S, denoted H throughout, is defined as

Lower Bounds for Expected-Case Planar Point Location Theocharis Malamatos∗ point lies on a segment or vertex of S is zero.) The entropy P of S, denoted H throughout, is defined as

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2005-07-31 13:55:46
56Quipper: Concrete Resource Estimation in Quantum Algorithms Jonathan M. Smith Neil J. Ross

Quipper: Concrete Resource Estimation in Quantum Algorithms Jonathan M. Smith Neil J. Ross

Add to Reading List

Source URL: www.mathstat.dal.ca

Language: English - Date: 2014-12-02 01:30:24
57114  Chapter 11 Hard Problems This chapter is on “hard” problems in distributed computing. In sequential computing, there are NP-hard problems which are conjectured to take exponential

114 Chapter 11 Hard Problems This chapter is on “hard” problems in distributed computing. In sequential computing, there are NP-hard problems which are conjectured to take exponential

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:48
58

PDF Document

Add to Reading List

Source URL: csrc.nist.gov

Language: English - Date: 2015-04-03 14:55:52
59Airplane boarding, polynuclear growth, disk I/O scheduling and space-time geometry 1 4  Eitan Bachmat1 , Daniel berend1,2 , Luba Sapir3 and Steven Skiena4

Airplane boarding, polynuclear growth, disk I/O scheduling and space-time geometry 1 4 Eitan Bachmat1 , Daniel berend1,2 , Luba Sapir3 and Steven Skiena4

Add to Reading List

Source URL: www.cs.bgu.ac.il

Language: English - Date: 2004-12-19 09:37:25
60Communication Complexity Advanced Algorithms – COMS31900 this is Alice

Communication Complexity Advanced Algorithms – COMS31900 this is Alice

Add to Reading List

Source URL: www.cs.bris.ac.uk

Language: English - Date: 2014-03-11 09:18:22